Parallel Implementations of the Jacobi Linear Algebraic Systems Solve
نویسندگان
چکیده
The objective of this research is to construct parallel implementations of the Jacobi algorithm used for the solution of linear algebraic systems, to measure their speedup with respect to the serial case and to compare each other, regarding their efficiency. The programming paradigm used in this implementation is the message passing model, while, the MPI implementation used is the MPICH implementation of the Argonne National Laboratory.
منابع مشابه
Jacobi Operational Matrix Approach for Solving Systems of Linear and Nonlinear Integro-Differential Equations
This paper aims to construct a general formulation for the shifted Jacobi operational matrices of integration and product. The main aim is to generalize the Jacobi integral and product operational matrices to the solving system of Fredholm and Volterra integro--differential equations which appear in various fields of science such as physics and engineering. The Operational matr...
متن کاملParallel Overrelaxation Algorithms for Systems of Linear Equations
Parallel versions of the Jacobi and Successive Overrelaxation methods to solve systems of linear equations on a network of transputers are discussed. The Jacobi method is easily parallelizable, by distributing the data in a rowwise fashion among the processors. The SOR is a less obviously parallelizable method due to data-dependency issues, although some computation can still be distributed. An...
متن کاملAlgebraic Multigrid
In computer simulation of particular systems (e.g. in physics, biology, economics), partial differential equations (PDE) are solved numerically, mainly by applying Finite Element (FE) or Finite Difference (FD) Analysis. This methods lead to algebraic systems of equations with large, sparse system matrices that have to be solved. Since direct solvers can not exploit the sparsity when the structu...
متن کاملReducing Communication Costs Associated with Parallel Algebraic Multigrid
Algebraic multigrid (AMG) is an iterative method for solving sparse linear systems of equations (Ax̂ = b), such as discretized partial differential equations arising in various fields of science and engineering. AMG is considered an optimal solver, requiring only O(n) operations to solve a system of n unknowns. Standard computers contain neither the memory nor computing power to solve increasing...
متن کاملNew concepts on the fuzzy linear systems and an application
As we know, developing mathematical models and numerical procedures that would appropriately treat and solve systems of linear equations where some of the system's parameters are proposed as fuzzy numbers is very important in fuzzy set theory. For this reason, many researchers have used various numerical methods to solve fuzzy linear systems. In this paper, we define the concepts of midpoint a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1403.5805 شماره
صفحات -
تاریخ انتشار 2007